#ifndef KNAPSACKS_H
#define KNAPSACKS_H

// A Naive recursive implementation of 0-1 Knapsack problem
int knapSackNaive(int W, int wt[], int val[], int n);

// A Dynamic Programming based solution for 0-1 Knapsack problem
// avoid Overlapping Subprolems property
int knapSack(int W, int wt[], int val[], int n);


void Test_knapsack();


#endif // KNAPSACKS_H
